Abelian closures of infinite binary words

Two finite words u and v are called Abelian equivalent if each letter occurs equally many times in both v. The abelian closure A(x) of (the shift orbit of) an infinite word x is the set y such that, for factor y, there exists a which to u. notion gives characterization Sturmian words: among binary uniformly recurrent words, exactly those equals Ω(x). In this paper we show contrary larger alphabets, aperiodic not contains infinitely minimal subshifts.